A Modest, but Semantically Well Founded, Inheritance Reasoner
نویسنده
چکیده
A modest exception allowing inheritance reasoner is presented The reasoner allows restricted but seman tically well founded defeasible property inheritance Furthermore it gives a well de ned and easily under stood semantic interpretation to all of the assertions
منابع مشابه
DReW: a Reasoner for Datalog-rewritable Description Logics and DL-Programs
Nonmonotonic dl-programs provide a loose integration of Description Logic (DL) ontologies and Logic Programming (LP) rules with negation, where a rule engine can query an ontology with a native DL reasoner. However, even for tractable dl-programs, the overhead of an external DL reasoner might be considerable. Datalog-rewritable DL ontologies, such as LDL, can be rewritten to Datalog programs, s...
متن کاملMore on Inheritance Hierarchies with Exceptions: Default Theories and Inferential Distance
In Artificial Intelligence, well-understood reasoning systems and tractable reasoning systems have often seemed mutually exclusive. This has been exemplified by nonmonotonic reasoning formalisms and inheritance-with-exceptions reasoners. These have epitomized the two extremes: the former not even semidecidable, the latter completely ad hoc. We previously presented a formal mechanism for specify...
متن کاملA Logic for Approximate First-Order Reasoning
In classical approaches to knowledge representation, reasoners are assumed to derive all the logical consequences of their knowledge base. As a result, reasoning in the first-order case is only semi-decidable. Even in the restricted case of finite universes of discourse, reasoning remains inherently intractable, as the reasoner has to deal with two independent sources of complexity: unbounded c...
متن کاملEQuIKa System: Supporting OWL applications with local closed world assumption
One of the major advantages of semantically annotating resources on Web is the facilitation of web services discovery. Languages based on OWL are prune to several problems for web services discovery due to the open-world assumption when handling incomplete information. Thus standard OWL reasoner are usually not suitable for the discovery purposes. The aforementioned problems can easily be fixed...
متن کاملTractable Reasoning via Approximation
Problems in logic are well-known to be hard to solve in the worst case. Twodi erent strategies for dealing with this aspect are known from the literature:language restriction and theory approximation.In this paper we are concerned with the second strategy. Our main goalis to de ne a semantically well-founded logic for approximate reasoning, whichis justi able from the in...
متن کامل